A descriptive study on public transport user behaviour from Live Bus Arrivals

In order to offer public transport that meet citizens’ needs for transport and further increase the use of bus services, Public Authorities need to analyse and understand travellers behaviour. Automatic Vehicle Location (AVL) data provide information on the observed time of arrival and departure of a bus at each stop. These data are fed into an algorithm to provide information to users on the expected time of arrival at the bus stop by an on-line service. In the city of London this service is called Live Bus Arrivals. This work describes the general behaviour of Live Bus Arrivals users by analysing the type of requests, localising them and compare them in different days of the week and time ranges. The objective is to identify some of the main passengers’ origin, destination and interchanges behaviour that could be of value to decision-makers and planners

An Improved Upper Bound for the Ring Loading Problem

The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists alike. Given an undirected cycle on $n$ nodes together with non-negative demands between any pair of nodes, the Ring Loading Problem asks for an unsplittable routing of the demands such that the maximum cumulated demand on any edge is minimized. Let $L$ be the value of such a solution. In the relaxed version of the problem, each demand can be split into two parts where the first part is routed clockwise while the second part is routed counter-clockwise. Denote with $L^*$ the maximum load of a minimum split routing solution. In a landmark paper, Schrijver, Seymour and Winkler [SSW98] showed that $L \leq L^* + 1.5D$, where $D$ is the maximum demand value. They also found (implicitly) an instance of the Ring Loading Problem with $L = L^* + 1.01D$. Recently, Skutella [Sku16] improved these bounds by showing that $L \leq L^* + \frac{19}{14}D$, and there exists an instance with $L = L^* + 1.1D$. We contribute to this line of research by showing that $L \leq L^* + 1.3D$. We also take a first step towards lower and upper bounds for small instances

Polynomial-time approximation schemes for scheduling problems with time lags

We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the number of machines and the ratio between the largest time lag and the smallest positive operation time. These classes constitute the first PTAS results for scheduling problems with time lags

Multi-user interference mitigation under limited feedback requirements for WCDMA systems with base station cooperation

One of the techniques that has been recently identified for dealing with multi-user interference (MUI) in future communications systems is base station (BS) cooperation or joint processing. However, perfect MUI cancellation with this technique demands severe synchronization requirements, perfect and global channel state information (CSI), and an increased backhaul and signaling overhead. In this paper, we consider a more realistic layout with the aim of mitigating the MUI, where only local CSI is available at the BSs. Due to synchronization inaccuracies and errors in the channel estimation, the system becomes partially asynchronous. In the downlink of wideband code division multiple access based systems, this asynchronism stands for the loss of the orthogonality of the spreading codes allocated to users and thus, for an increase in the MUI level of the system. In this contribution, we propose a framework for mitigating the MUI which builds in three main steps: definition of a cooperation area based on the channel characteristics, statistical modeling of the average MUI power experienced by each user and a specific spreading code allocation scheme for users served with joint processing. This code allocation assigns spreading codes to users in such a way that minimum average cross-correlation between active users can be achieved. Interestingly, these steps can be performed with a limited amount of extra feedback from the user's side

Efficient algorithms for the assignment of OVSF codes in wideband CDMA

This paper proposes some novel techniques to accommodate users with different transmission rate requirements in a CDMA system which employs orthogonal variable spreading factor codes. Several static and dynamic code assignment strategies are put forth and their behavior investigated, in terms of call blocking probability and number of required call reassignments. Their efficiency in dealing with various traffic loads is demonstrated, quantitatively showing the superior performance of our dynamic scheme with respect to a so-called "optimal" code assignment strategy recently presented in literature